Complexity of Gaussian-radial-basis networks approximating smooth functions
نویسندگان
چکیده
منابع مشابه
Complexity of Gaussian-radial-basis networks approximating smooth functions
Complexity of Gaussian radial-basis-function networks, with varying widths, is investigated. Upper bounds on rates of decrease of approximation errors with increasing number of hidden units are derived. Bounds are in terms of norms measuring smoothness (Bessel and Sobolev norms) multiplied by explicitly given functions a(r, d) of the number of variables d and degree of smoothness r. Estimates a...
متن کاملStable Computations with Gaussian Radial Basis Functions
Radial basis function (RBF) approximation is an extremely powerful tool for representing smooth functions in non-trivial geometries, since the method is meshfree and can be spectrally accurate. A perceived practical obstacle is that the interpolation matrix becomes increasingly illconditioned as the RBF shape parameter becomes small, corresponding to flat RBFs. Two stable approaches that overco...
متن کاملGaussian Radial Basis Functions for Simulation Metamodeling
This paper presents a novel approach for developing simulation metamodels using Gaussian radial basis functions. This approach is based on some recently developed mathematical results for radial basis functions. It is systematic, explicitly controls the underfitting and overfitting tradeoff, and uses a fast computational algorithm that requires minimal human involvement. This approach is illust...
متن کاملGaussian Naive Bayes with Smooth Basis Functions
We examine advantages of using smooth basis functions in classifying fMRI (functional MR Imaging) data. fMRI data is a measurement of neural activity in the brain. It allows us to see how each part of the brain responses to stimuli. The task in which we are interested is to identify mental states from some given fMRI data. Specifically, we want to classify between two different states using lab...
متن کاملNormalized Gaussian Radial Basis Function networks
Abstract: The performances of Normalised RBF (NRBF) nets and standard RBF nets are compared in simple classification and mapping problems. In Normalized RBF networks, the traditional roles of weights and activities in the hidden layer are switched. Hidden nodes perform a function similar to a Voronoi tessellation of the input space, and the output weights become the network's output over the pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2009
ISSN: 0885-064X
DOI: 10.1016/j.jco.2008.08.001